InfoMax Classification-Enhanced Learnable Network for Few-Shot Node Classification
نویسندگان
چکیده
Graph neural networks have a wide range of applications, such as citation networks, social and knowledge graphs. Among various graph analyses, node classification has garnered much attention. While many the recent network embedding models achieve promising performance, they usually require sufficient labeled nodes for training, which does not meet reality that only few are available in novel classes. few-shot learning is commonly employed vision language domains to address problem insufficient training samples, there still two characteristics non-Euclidean domain investigation: (1) how extract most informative class use it on testing data (2) thoroughly explore limited number support sets maximize amount information transferred query set. We propose an InfoMax Classification-Enhanced Learnable Network (ICELN) these issues, motivated by Deep (DGI), adapts principle summary representation patch node. By increasing shared between representation, ICELN can transfer maximum unlabeled enhance potential. The whole model trained using episodic method, simulates actual environment ensure meta-knowledge learned from previous experience may be used entirely new classes been studied before. Extensive experiments conducted five real-world datasets demonstrate advantages over existing methods.
منابع مشابه
Few-shot Classification by Learning Disentangled Representations
Machine learning has improved state-of-the art performance in numerous domains, by using large amounts of data. In reality, labelled data is often not available for the task of interest. A fundamental problem of artificial intelligence is finding a representation that can generalize to never seen before classes. In this research, the power of generative models is combined with disentangled repr...
متن کاملMeta-Learning for Semi-Supervised Few-Shot Classification
In few-shot classification, we are interested in learning algorithms that train a classifier from only a handful of labeled examples. Recent progress in few-shot classification has featured meta-learning, in which a parameterized model for a learning algorithm is defined and trained on episodes representing different classification problems, each with a small labeled training set and its corres...
متن کاملShortcut Node Classification for Membrane Residue Curve Maps
comNode classification within Membrane Residue Curves (M-RCMs) currently hinges on Lyapunov’s Theorem and therefore the computation of mathematically complex eigenvalues. This paper presents an alternative criterion for the classification of nodes within M-RCMs based on the total membrane flux at node compositions. This paper demonstrates that for a system exhibiting simple permeation behaviour...
متن کاملLearnable Pooling Regions for Image Classification
Biologically inspired, from the early HMAX model to Spatial Pyramid Matching, pooling has played an important role in visual recognition pipelines. Spatial pooling, by grouping of local codes, equips these methods with a certain degree of robustness to translation and deformation yet preserving important spatial information. Despite the predominance of this approach in current recognition syste...
متن کاملLabel-dependent node classification in the network
Relations between objects in various systems, such as hyperlinks connecting web pages, citations of scientific papers, conversations via email or social interactions in Web 2.0 portals are commonly modeled by networks. One of many interesting problems currently studied for such domains is node classification. Due to the nature of the networked data and the unavailability of collection of nodes’...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics
سال: 2023
ISSN: ['2079-9292']
DOI: https://doi.org/10.3390/electronics12010239